Application of Election Functions to Estimate the Number of Monotone Self-Dual Boolean functions

One of the problems modern discrete mathematics is R. Dedekind problem on number monotone boolean functions. For other precomplete classes, general formulas for functions classes had been found, but it has not found so far class Within framework this problem, there are a lower level. them absence formula intersection $MS$ two --- and self-dual In paper, new bounds proposed estimating cardinality both an even odd variables. It shown that election function variables self-dual. The determined. Free functions, which with fictitious similar in properties to introduced. Then union set free considered, calculated. resulting value as bound $|MS|$. variables, improved over earlier, $|MS|$ presented first time.